Unextendible Product Bases, Uncompletable Product Bases and Bound Entanglement
نویسندگان
چکیده
منابع مشابه
Unextendible Product Bases, Uncompletable Product Bases and Bound Entanglement
We report new results and generalizations of our work on unextendible product bases (UPB), uncompletable product bases and bound entanglement. We present a new construction for bound entangled states based on product bases which are only completable in a locally extended Hilbert space. We introduce a very useful representation of a product basis, an orthogonality graph. Using this representatio...
متن کاملUnextendible Product Bases
Let C denote the complex field. A vector v in the tensor product ⊗i=1C is called a pure product vector if it is a vector of the form v1 ⊗ v2 · · · ⊗ vm, with vi ∈ Ci . A set F of pure product vectors is called an unextendible product basis if F consists of orthogonal nonzero vectors, and there is no nonzero pure product vector in ⊗i=1C which is orthogonal to all members of F . The construction ...
متن کاملDistinguishability of complete and unextendible product bases
It is not always possible to distinguish multipartite orthogonal states if only local operation and classical communication (LOCC) are allowed. We prove that we cannot distinguish the states of an unextendible product bases (UPB) by LOCC even when infinite resources (infinite-dimensional ancillas, infinite number of operations). Moreover we give a method to check the LOCC distinguishability of ...
متن کاملCharacterizing unextendible product bases in qutrit-ququad system
Unextendible product bases (UPBs) play an important role in quantum information theory. However, very little is known about UPBs in Hilbert space of local dimension more than three. In this paper, we study the UPBs in qutrit-ququad system and find that there only exist six, seven and eight-state UPBs. We completely characterize the six-state and seven-state UPBs. For eight-state UPBs, seven cla...
متن کاملThe Minimum Size of Qubit Unextendible Product Bases
We investigate the problem of constructing unextendible product bases in the qubit case – that is, when each local dimension equals 2. The cardinality of the smallest unextendible product basis is known in all qubit cases except when the number of parties is a multiple of 4 greater than 4 itself. We construct small unextendible product bases in all of the remaining open cases, and we use graph ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Mathematical Physics
سال: 2003
ISSN: 0010-3616,1432-0916
DOI: 10.1007/s00220-003-0877-6